An efficient minimum-distance decoding algorithm for convolutional error-correcting codes

Design Methods for Maximum Minimum-Distance Error-Correcting Codes

In error-correcting codes for combating noisy transmission channels, a central concept i s the notion of minimum distance. If a code can be constructed with minimum distance between code points of 2m-k 1 I then any number of errors per code word which does not exceed m can be corrected, thus increasing the reliability of transmission above that to be expected with no redundancy i n the code. An...

An Algebraic Decoding Algorithm for Convolutional Codes

The class of convolutional codes generalizes the class of linear block codes in a natural way. The construction of convolutional codes which have a large free distance and which come with an e cient decoding algorithm is a major task. Contrary to the situation of linear block codes there exists only very few algebraic construction of convolutional codes. It is the purpose of this article to int...

Quantum mean-field decoding algorithm for error-correcting codes

We numerically examine a quantum version of TAP (Thouless-Anderson-Palmer)like mean-field algorithm for the problem of error-correcting codes. For a class of the so-called Sourlas error-correcting codes, we check the usefulness to retrieve the original bit-sequence (message) with a finite length. The decoding dynamics is derived explicitly and we evaluate the average-case performance through th...

Linear Binary Error Correcting Codes with Specified Minimum Hamming Distance

Decoding of Ternary Error Correcting Output Codes

Error correcting output codes (ECOC) represent a successful extension of binary classifiers to address the multiclass problem. Lately, the ECOC framework was extended from the binary to the ternary case to allow classes to be ignored by a certain classifier, allowing in this way to increase the number of possible dichotomies to be selected. Nevertheless, the effect of the zero symbol by which d...